Temporal Matrix Completion with Locally Linear Latent Factors for Medical Applications

نویسندگان

  • Frodo Kin-Sun Chan
  • Andy Jinhua Ma
  • Pong C. Yuen
  • Terry Cheuk-Fung Yip
  • Yee-Kit Tse
  • Vincent Wai-Sun Wong
  • Grace Lai-Hung Wong
چکیده

Regular medical records are useful for medical practitioners to analyze and monitor patient’s health status especially for those with chronic disease, but such records are usually incomplete due to unpunctuality and absence of patients. In order to resolve the missing data problem over time, tensorbased model is suggested for missing data imputation in recent papers because this approach makes use of low rank tensor assumption for highly correlated data. However, when the time intervals between records are long, the data correlation is not high along temporal direction and such assumption is not valid. To address this problem, we propose to decompose a matrix with missing data into its latent factors. Then, the locally linear constraint is imposed on these factors for matrix completion in this paper. By using a publicly available dataset and two medical datasets collected from hospital, experimental results show that the proposed algorithm achieves the best performance by comparing with the existing methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Temporal Regularized Matrix Factorization

Matrix factorization approaches have been applied to a variety of applications, from recommendation systems to multi-label learning. Standard low rank matrix factorization methods fail in cases when the data can be modeled as a time series, since they do not take into account the dependencies among factors, while EM algorithms designed for time series data are inapplicable to large multiple tim...

متن کامل

Learning Latent Features with Pairwise Penalties in Matrix Completion

Low-rank matrix completion (MC) has achieved great success in many real-world data applications. A latent feature model formulation is usually employed and, to improve prediction performance, the similarities between latent variables can be exploited by pairwise learning, e.g., the graph regularized matrix factorization (GRMF) method. However, existing GRMF approaches often use a squared L2 nor...

متن کامل

Locally Dependent Latent Trait Model for Polytomous Responses with Application to Inventory of Hostility Edward H. Ip Wake Forest University

Psychological tests often involve item dusters that are designed to solicit responses to behavioral stimuli. The dependency between individual responses within dusters beyond that which can be explained by the underlying trait sometimes reveals structures that are of substantive interest. The paper describes two general classes of models for this type of locally dependent responses. Specificall...

متن کامل

Bornological Completion of Locally Convex Cones

In this paper, firstly, we obtain some new results about bornological convergence in locally convex cones (which was studied in [1]) and then we introduce the concept of bornological completion for locally convex cones. Also, we prove that the completion of a bornological locally convex cone is bornological. We illustrate the main result by an example.

متن کامل

A method for solving fully fuzzy linear system with trapezoidal fuzzy numbers

Different methods have been proposed for finding the non-negative solution of fully fuzzy linear system (FFLS) i.e. fuzzy linear system with fuzzy coefficients involving fuzzy variables. To the best of our knowledge, there is no method in the literature for finding the non-negative solution of a FFLS without any restriction on the coefficient matrix. In this paper a new computational method is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1611.00800  شماره 

صفحات  -

تاریخ انتشار 2016